Parametric polymorphism for XML
نویسندگان
چکیده
منابع مشابه
Typed parametric polymorphism for aspects
We study the incorporation of generic types in aspect languages. Since advice acts likemethod update, such a study has to accommodate the subtleties of the interaction of classes,polymorphism and aspects. Indeed, simple examples demonstrate that current aspect com-piling techniques do not avoid runtime type errors.We explore type systems with polymorphism for two models of param...
متن کاملLightweight Parametric Polymorphism for Oberon
Strongly typed polymorphism is necessary for expressing safe reusable code. Two orthogonal forms of polymorphism exist: inclusion and parametric, the Oberon language only supports the former. We describe a simple extension to Oberon to support parametric polymor-phism. The extension is in keeping with the Oberon language: it is simple and has an explicit cost. In the paper we motivate the need ...
متن کاملA Logic for Parametric Polymorphism
In this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simply-typed -calculus with recursion and arithmetic, our logic is a logic for System F. The logic permits the formal presentation and use of relational parametricity. Parametricity yields|for example|encodings of initial algebras, nal co-algebras and abstract datatypes, with corresponding proof princ...
متن کاملParametric Polymorphism - Universally
In the 1980s, John Reynolds postulated that a parametrically polymorphic function is an ad-hoc polymorphic function satisfying a uniformity principle. This allowed him to prove that his set-theoretic semantics has a relational lifting which satisfies the Identity Extension Lemma and the Abstraction Theorem. However, his definition (and subsequent variants) have only been given for specific mode...
متن کاملCombining Inclusion Polymorphism and Parametric Polymorphism
We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the typability problem to the problem of solving a system of type inequations. The result is then obtained by showing that the solvability of the resulting system of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Programming Languages and Systems
سال: 2009
ISSN: 0164-0925,1558-4593
DOI: 10.1145/1596527.1596529